On the efficient calculation of van Rossum distances.

نویسندگان

  • Conor Houghton
  • Thomas Kreuz
چکیده

The van Rossum metric measures the distance between two spike trains. Measuring a single van Rossum distance between one pair of spike trains is not a computationally expensive task, however, many applications require a matrix of distances between all the spike trains in a set or the calculation of a multi-neuron distance between two populations of spike trains. Moreover, often these calculations need to be repeated for many different parameter values. An algorithm is presented here to render these calculation less computationally expensive, making the complexity linear in the number of spikes rather than quadratic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Calculation of Optimum Dimensions and Array of Submerged Vanes at Intakes Using the Feasible Direction Method

In recent years, installation of plates in canal beds have been considered for sedimentation control and bed load reduction at canal intake. These planes, called submerged vanes, are different in dimensions. They are installed at intakes in-group with reasonable distance from each other. Presence of these vanes at intakes initiate transverse shear stress on river bed and causes sediment transpo...

متن کامل

Calculation of Optimum Dimensions and Array of Submerged Vanes at Intakes Using the Feasible Direction Method

In recent years, installation of plates in canal beds have been considered for sedimentation control and bed load reduction at canal intake. These planes, called submerged vanes, are different in dimensions. They are installed at intakes in-group with reasonable distance from each other. Presence of these vanes at intakes initiate transverse shear stress on river bed and causes sediment transpo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Network

دوره 23 1-2  شماره 

صفحات  -

تاریخ انتشار 2012